R-Tree Implementation of Image Databases

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

R-tree: A Hardware Implementation

R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the query operation on R-tree data structure has an important impact on the performance of spatial databases. To boost the performance of R-tree search operations, we propose a new parallel R-tree search algorithm, which u...

متن کامل

Hilbert R - tree : An improved R - tree

We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing an ordering on the R-tree nodes. This ordering has to be 'good', in the sense that it should group 'similar' data rectangles together, to minimize the area and perimeter of the resulting minimum bounding rectangles (M...

متن کامل

Implementation of Four Walsh Transform Sectors for Image Retrieval from Image Databases

The work of this paper presents the new idea of using Walsh transform to generate the feature vector for content based image retrieval. The complex Walsh transform is conceived by multiplying Sal functions by j and combining them with Cal functions of the same frequency. The angle is calculated by taking tan inverse of sal/cal in the range of 0 to 360 degrees which is divided into 4 sectors. Th...

متن کامل

Computationally efficient algorithms for statistical image processing. Implementation in R

Abstract: In the series of our earlier papers on the subject, we proposed a novel statistical hypothesis testing method for detection of objects in noisy images. The method uses results from percolation theory and random graph theory. We developed algorithms that allowed to detect objects of unknown shapes in the presence of nonparametric noise of unknown level and of unknown distribution. No b...

متن کامل

Fractal Tree Databases

From February 28th to March 5th 2010, the Dagstuhl Seminar 10091 "Data Structures" was held in Schloss Dagstuhl Leibniz Center for Informatics. It brought together 45 international researchers to discuss recent developments concerning data structures in terms of research, but also in terms of new technologies that impact how data can be stored, updated, and retrieved. During the seminar a fair ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Signal & Image Processing : An International Journal

سال: 2011

ISSN: 2229-3922

DOI: 10.5121/sipij.2011.2408